networking n. 1.網(wǎng)絡(luò)化。 2.【計(jì)算機(jī)】電腦網(wǎng)絡(luò),網(wǎng)絡(luò)系統(tǒng);建網(wǎng),聯(lián)網(wǎng)。
task n. 1.(派定的)工作,任務(wù),功課。 2.艱苦的工作,苦差使。 3.〔廢語〕租稅,稅款。 set (sb.) a task 派(某人)一個(gè)任務(wù)。 be at one's task 在做著工作。 It's quite a task to figure out 10 problems in an hour. 一小時(shí)內(nèi)算出十道習(xí)題可是個(gè)艱苦的工作。 bring [call, take] sb. to task (for doing sth.) (為…)責(zé)備(某人)。 take a task upon oneself 接受任務(wù)。 vt. 1.派給工作。 2.虐待,使作苦工。 3.〔廢語〕課稅。 task one's energies 盡全力。 taskbar 【計(jì)算機(jī)】(通常顯示于電腦屏幕底部的)任務(wù)欄。
When the process scheduler sees that there are networking tasks to do it runs the network bottom - half 當(dāng)進(jìn)程調(diào)度器發(fā)現(xiàn)有網(wǎng)絡(luò)任務(wù)要運(yùn)行時(shí)則運(yùn)行網(wǎng)絡(luò)底半程序。
Finally it describes a new network task scheduling algorithm which considers both throughput and latency . the contributions of this paper are as below : proposed a new duplication based task scheduling algorithm for fork - join graph considering the communication limits between different processors , named tdc _ fj . the test results show that tdc _ fj is flexible and effective for fork - join graph and it achieves good performance and reduces the requirements of processors 本文主要貢獻(xiàn)如下:提出了滿足通信限制的基于復(fù)制的優(yōu)化fork - join調(diào)度算法tdc _ fj , tdc _ fj利用基于復(fù)制的fork - join最優(yōu)化調(diào)度結(jié)果來對(duì)fork - join任務(wù)圖進(jìn)行調(diào)度,并且在調(diào)度過程中加入處理器之間的通信限制,也就是一條通信信道不能同時(shí)被兩個(gè)通信事件占用。